Some Experiments Using Term Rewriting Techniques for Concurrency
نویسندگان
چکیده
Theorem proving using term rewriting has been thoroughly explored for equational speciications; we look at the use of term rewriting for proving theorems in the process algebras of concurrency and conduct two experiments in this area. We use the LP theorem prover for proofs about CSP, and the RRL term rewriting system for reasoning about LOTOS. The results of these experiments provide information about possible enrichments to term rewriting theory that will make it more eeective in reasoning about concurrent systems.
منابع مشابه
The Application of Term Rewriting Systems for Expressing Generic Program Slicing Algorithms
Program slicing is a technique in software engineering for isolating parts of a program that influence the value of a variable or some other arbitrary expression in that program. There exist many different slicing algorithms, with specific techniques for a variety of language features such as procedures, unstructured control flow, composite data types, pointers, concurrency, etc. This paper sho...
متن کاملA Trully Concurrent Semantics for the K Framework Based on Graph Transformations
This paper gives a truly concurrent semantics with sharing of resources for the K semantic framework, an executable (term-)rewritingbased formalism for defining programming languages and calculi. Akin to graph rewriting rules, the K (rewrite) rules explicitly state what can be concurrently shared with other rules. The desired true concurrency is obtained by translating the K rules into a novel ...
متن کاملObject-Oriented Term Graph Rewriting
The relationship between the generalised computational model of Term Graph Rewriting Systems (TGRS) and Object-Oriented Programming (OOP) is explored and exploited by extending the TGRS model with records where access to parameters is done by naming rather than position. Records are then used as the basis for expressing object-oriented techniques such as object encapsulation and (various forms ...
متن کاملTowards Modelling Actor-Based Concurrency in Term Rewriting
In this work, we introduce a scheme for modelling actor systems within sequential term rewriting. In our proposal, a TRS consists of the union of three components: the functional part (which is specific of a system), a set of rules for reducing concurrent actions, and a set of rules for defining a particular scheduling policy. A key ingredient of our approach is that concurrent systems are mode...
متن کاملCombining Algebraic Computing and Term-Rewriting for Geometry Theorem Proving
This note reports some of our investigations on combining algebraic computing and term-rewriting techniques for automated geometry theorem proving. A general approach is proposed that requires both Clifford algebraic reduction and term-rewriting. Preliminary experiments for some concrete cases have been carried out by combining routines implemented in Maple V and Objective Caml. The experiments...
متن کامل